Interpolation in Grothendieck Institutions

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Interpolation in Grothendieck Institutions

It is well known that interpolation properties of logics underlying speci.cation formalisms play an important role in the study of structured speci.cations, they have also many other useful logical consequences. In this paper, we solve the interpolation problem for Grothendieck institutions which have recently emerged as an important mathematical structure underlying heterogenous multi-logic sp...

متن کامل

Institutional 2-cells and Grothendieck Institutions

We propose to use Grothendieck institutions based on 2categorical diagrams as a basis for heterogeneous specification. We prove a number of results about colimits and (some weak variants of) exactness. This framework can also be used for obtaining proof systems for heterogeneous theories involving institution semi-morphisms.

متن کامل

Grothendieck quasitoposes

Article history: Received 28 June 2011 Available online 31 January 2012 Communicated by Michel Van den Bergh

متن کامل

Combinatorial Formulae for Grothendieck-demazure and Grothendieck Polynomials

∂if = f− sif xi − xi+1 where si acts on f by transposing xi and xi+1 and let π̃i = ∂i(xi(1− xi+1)f) Then the Grothendieck-Demazure polynomial κα, which is attributed to A. Lascoux and M. P. Schützenberger, is defined as κα = x α1 1 x α2 2 x α3 3 ... if α1 ≥ α2 ≥ α3 ≥ ..., i.e. α is non-increasing, and κα = π̃iκαsi if αi < αi+1, where si acts on α by transposing the indices. Example 2.1. Let α = (...

متن کامل

Presentation of K Nearest Neighbor Gaussian Interpolation and comparing it with Fuzzy Interpolation in Speech Recognition

Hidden Markov Model is a popular statisical method that is used in continious and discrete speech recognition. The probability density function of observation vectors in each state is estimated with discrete density or continious density modeling. The performance (in correct word recognition rate) of continious density is higher than discrete density HMM, but its computation complexity is very ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Theoretical Computer Science

سال: 2004

ISSN: 0304-3975

DOI: 10.1016/j.tcs.2003.10.030